An l-Span Generalized Secret Sharing Scheme

For some secret sharing applications, the secret reconstructed is not revealed to the participants, and therefore, the secredshadows can be repeatedly used without having to be changed. But for other applications, in which the secret reconstructed is revealed to participants, a new secret must be chosen and its corresponding shadows must be regenerated and then secretly distributed to participants again, in order to enforce the same secret sharing policy, This is inefficient because of the overhead in the generation and distribution of shadows. In this paper, an I-span secret sharing scheme for the general sharing policy is proposed to solve the secredshadows regeneration problem by extending the life span of the shadows from I to I , i. e., the shadows can be repeatedly used for 1 times to generate 1 different secrets.